- recursively approximable set
- Математика: рекурсивно аппроксимируемое множество
Универсальный англо-русский словарь. Академик.ру. 2011.
recursively approximable set
Смотреть что такое "recursively approximable set" в других словарях:
Vertex cover problem — In computer science, the vertex cover problem or node cover problem is an NP complete problem and was one of Karp s 21 NP complete problems. It is often used in complexity theory to prove NP hardness of more complicated problems. Definition A… … Wikipedia
